An abstract factorization theorem and some applications
نویسندگان
چکیده
We combine the language of monoids with preorders so as to refine some fundamental aspects classical theory factorization and prove an abstract theorem a variety applications. In particular, we obtain generalization, from cancellative Dedekind-finite (commutative or non-commutative) monoids, on "atomic factorizations" that traces back work P.M. Cohn in 1960s; recover D.D. Anderson S. Valdes-Leon "irreducible commutative rings; improve A.A. Antoniou author characterizes atomicity certain "monoids sets" naturally arising additive number arithmetic combinatorics; give monoid-theoretic proof every module finite uniform dimension over ring $R$ is direct sum finitely many indecomposable modules (this fact special case more general decomposition for objects categories products, where $R$-modules are characterized atoms suitable "monoid modules").
منابع مشابه
An Abstract Factorization Theorem for Explicit Substitutions
We study a simple form of standardization, here called factorization, for explicit substitutions calculi, i.e. lambda-calculi where beta-reduction is decomposed in various rules. These calculi, despite being non-terminating and non-orthogonal, have a key feature: each rule terminates when considered separately. It is well-known that the study of rewriting properties simplifies in presence of te...
متن کاملAbstract Decomposition Theorem and Applications
DECOMPOSITION THEOREM AND APPLICATIONS RAMI GROSSBERG AND OLIVIER LESSMANN Abstract. In this paper, we prove a decomposition theorem for abstract elementary classes K with the amalgamation property, under the assumption that certain axioms regarding independence, existence of some prime models, and regular types are satisfied. This context encompasses the following: (1) K is the class of models...
متن کاملAn abstract standardisation theorem
The standardisation theorem is a key theorem in the-calculus. It implies that any normal form can be reached by the normal order (leftmost outermost) strategy. The theorem states that any reduction may be rearranged in a top-down and left-to-right order. This also holds in orthogonal term rewriting systems (TRS), although the left-to-right order is more subtle. We give a new presentation of the...
متن کاملAn Analogue of the Narasimhan-seshadri Theorem and Some Applications
We prove an analogue in higher dimensions of the classical Narasimhan-Seshadri theorem for strongly stable vector bundles with c1 = 0 on a smooth projective variety X . As applications, over fields of characteristic zero, we derive an effective version of the main theorem in a recent paper of Balaji and Kollár ([3]), and over uncountable fields of positive characteristics, if G is a semisimple ...
متن کاملA Stone’s Representation Theorem and Some Applications
In this paper, we prove the following form of Stone’s representation theorem: Let ∑ be a σ -algebra of subsets of a set X . Then there exists a totally disconnected compact Hausdorff space K for which ( ∑ ,∪,∩) and (C(K),∪,∩) , where C(K) denotes the set of all clopen subsets of K , are isomorphic as Boolean algebras. Furthermore, by defining appropriate joins and meets of countable families in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2022
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2022.03.023